Divisibility properties of certain factorials

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Divisibility Properties by Multisection

The/?-adic order, vp(r), of r is the exponent of the highest power of a prime/? which divides r. We characterize the/?-adic order vp(Fn) of the F„ sequence using multisection identities. The method of multisection is a helpful tool in discovering and proving divisibility properties. Here it leads to invariants of the modulo p Fibonacci generating function for p ^ 5. The proof relies on some sim...

متن کامل

ON DIVISIBILITY PROPERTIES OF CERTAIN FIBONOMIAL COEFFICIENTS BY A PRIME p

Let (Fn)n≥0 be the Fibonacci sequence. For 1 ≤ k ≤ m, the Fibonomial coefficient is defined as [ m k ] F = Fm−k+1 · · ·Fm−1Fm F1 · · ·Fk , and [ m k ] F = 0, for k > m. In this paper, we shall prove that if p is a prime number such that p ≡ −2 or 2 (mod 5), then p | [ p pa ]

متن کامل

On Divisibility Properties of Integers

1. Throughout this paper, we use the following notations : For any real number x let [x] denote the greatest integer less than or equal to x, and let lxll denote the distance from x to the nearest integer : jjxjl =min (x-[x], 1 + +[x]-x) . We write e""=e(x). The cardinality of the set X is denoted by JXJ . A (n) denotes the Mangoldt symbol . In this paper, our goal is to study the following pro...

متن کامل

Divisibility Properties of Hypergeometric Polynomials

In this paper we give effective upper bounds for the degree k of divisors (over Q) of hypergeometric polynomials defined by n

متن کامل

Divisibility of Certain Partition Functions by Powers of Primes

Let k = p11p a2 2 · · ·p am m be the prime factorization of a positive integer k and let bk(n) denote the number of partitions of a non-negative integer n into parts none of which are multiples of k. If M is a positive integer, let Sk(N ;M) be the number of positive integers n ≤ N for which bk(n) ≡ 0 (mod M). If pi i ≥ √ k, we prove that, for every positive integer j lim N→∞ Sk(N ; p j i ) N = ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1966

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1966.17.215